Tractable Analysis of a Finite Capacity Polling System under Bursty and Correlated Arrivals
نویسندگان
چکیده
This paper is concerned with the mean delay and the probability of cell loss that bursty arrivals incur in an ATM switching system which can be modeled as a finite capacity polling system with nonexhaustive cyclic service. The arrival process to each input port of the system is modeled by a Markov Modulated Bernoulli Process(MMBP) which is able to describe the bursty and correlated nature of the ATM traffic. A practical polling system with finite capacity, as the one we deal with here, does not lend itself to an exact solution. In this paper, we introduce a tractable approach to provide an analytical approximation. This approach is validated extensively by comparing it against simulation results under different configurations. It is shown that both the mean delays and the cell loss probabilities obtained from this analysis provide highly accurate estimates. Tractable Analysis of a Finite Capacity Polling System · · · Jou, Nilsson, and Lai. 1
منابع مشابه
A Refined Approximation of a Finite Capacity Polling System under ATM Bursty Arrivals
This paper is concerned with both the mean delay and the probability of cell loss that bursty arrivals incur in an ATM switching system which can be modeled as a finite capacity polling system with nonexhaustive cyclic service. The arrival process to each input port of the system is assumed to be bursty and is modeled by an Interrupted Bernoulli Process(IBP). A practical polling system with fin...
متن کاملThe Upper Bounds for Performance Measures of a Finite Capacity Polling System under ATM Bursty Arrivals
This paper focuses on the upper bounds for both the mean delay and the loss probability that bursty arrivals incur in an ATM switching system which can be modeled as a finite capacity polling system with nonexhaustive cyclic service. The arrival process to each input port of the system is assumed to be bursty and is modeled by an Interrupted Bernoulli Process(IBP). We compute the upper bounds f...
متن کاملAlgorithms for Computing Limit distributions of Oscillating Systems with Finite Capacity
We address the batch arrival systems with finite capacity under partial batch acceptance strategy where service times or rates oscillate between two forms according to the evolution of the number of customers in the system. Applying the theory of Markov regenerative processes and resorting to Markov chain embedding, we present a new algorithm for computing limit distributions of the number cus...
متن کاملDiscrete-time queue with Bernoulli bursty source arrival and generally distributed service times
In this contribution, a discrete-time single-server infinite-capacity queue with correlated arrivals and general service times is investigated. Arrivals of cells are modelled as an on/off source process with geometrically distributed on-periods and off-periods, which is called Bernoulli bursty source. Based on the probability generating function technique, closedform expression of some performa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007